Cluster Tails for Critical Power-Law Inhomogeneous Random Graphs
نویسندگان
چکیده
منابع مشابه
Critical behavior in inhomogeneous random graphs
We study the critical behavior of inhomogeneous random graphs where edges are present independently but with unequal edge occupation probabilities. We show that the critical behavior depends sensitively on the properties of the asymptotic degrees. Indeed, when the proportion of vertices with degree at least k is bounded above by k−τ+1 for some τ > 4, the largest critical connected component is ...
متن کاملNovel scaling limits for critical inhomogeneous random graphs
We find scaling limits for the sizes of the largest components at criticality for the rank-1 inhomogeneous random graphs with power-law degrees with exponent . We investigate the case where ∈ (3, 4), so that the degrees have finite variance but infinite third moment. The sizes of the largest clusters, rescaled by n−( −2)/( −1), converge to hitting times of a ‘thinned’ Lévy process. This process...
متن کاملEigenvalues of Random Power Law Graphs
Many graphs arising in various information networks exhibit the “power law” behavior – the number of vertices of degree k is proportional to k−β for some positive β. We show that if β > 2.5, the largest eigenvalue of a random power law graph is almost surely (1 + o(1)) √ m where m is the maximum degree. Moreover, the k largest eigenvalues of a random power law graph with exponent β have power l...
متن کاملEigenvalues of Random Power Law Graphs (DRAFT)
Many graphs arising in various information networks exhibit the “power law” behavior – the number of vertices of degree k is proportional to k−β for some positive β. We show that if β > 2.5, the largest eigenvalue of a random power law graph is almost surely (1+o(1)) √ m where m is the maximum degree. When 2 < β < 2.5, the largest eigenvalue is heavily concentrated at cm3−β for some constant c ...
متن کاملDistance Labelings on Random Power Law Graphs
Methods for answering distance queries on large graphs through a preprocessed data structure have a rich history of study. Recent evaluations on social and information networks have shown that there are very efficient landmark based labeling schemes on these networks, even for exact distances. However, it is unclear what are the essential properties of these networks that make short labelings p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Physics
سال: 2018
ISSN: 0022-4715,1572-9613
DOI: 10.1007/s10955-018-1978-0